Place change driven software update method and apparatus, and readable storage medium

ABSTRACT

The present invention relates to a place change driven software update method and apparatus, and a readable storage medium. The method includes: modeling a software architecture SA and an evolution rule set L⇒R through Bigraph; acquiring a software architecture SA t  after movement and before evolution of the SA; computing a place ΔP that changes between the SA and the SA t , thereby acquiring a corresponding evolution rule L j →R j ; and cutting a matching subgraph G L  on a link graph SA L  and replacing with a link graph R j   L  to obtain a new SA link graph SA L,e ; and merging the new SA place graph and the new SA link graph, thereby implementing update of the software architecture. Compared with the prior art, the present invention may describe place change information and system change information at the same time, and avoid the complexity, risk, unreliability and the like of conversion between different models.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims the priority benefit of China application serial no. 202011315914.9, filed on Nov. 22, 2020. The entirety of the above-mentioned patent application is hereby incorporated by reference herein and made a part of this specification.

BACKGROUND Technical Field

The present invention relates to the field of software update, and in particular to a place change driven software update method and apparatus, and a readable storage medium.

Description of Related Art

At present, in the field of software engineering, the software update mainly arises from the requirement and environment change, which leads to a requirement change driven software dynamic evolution method and an environment change driven software dynamic evolution method.

The requirement change driven software dynamic evolution method mainly focuses on functional requirements and non-functional requirements, respectively describes a requirement change model and a software system change model with the Unified Modeling Language (UML), process algebra, graph and other semi-formal or formal languages, and then associates with the two models in the unified language description; and thus, the requirement change driven system model also changes.

The environment change driven software dynamic evolution method mainly focuses on software environments and hardware environments, respectively describes an environment change model and a software system change model with the Architecture Description Language (ADL), process algebra, Petri network, graph and other semi-formal or formal languages, and then associates with the two models in the unified language description; and thus, the environment change driven system model also changes.

In a case where the place change driven software evolution is implemented, the place change model can only be described with one modeling language, and then the software system model is described with another modeling language; and the two models must be associated with an intermediary language. However, there are many risks, for examples, the error risk that one language is converted into another language, the risk that one language cannot be completely converted into another language, the risk that the intrinsic implicit information of the language is captured difficultly, and so on.

Presently, neither the requirement change driven software dynamic evolution method driven requirement change nor the environment change driven software dynamic evolution method can describe the place change model and the software system model at the same time.

To sum up, existing methods fail to focus on the technology that the place change leads to the software evolution, and are hard to meet and adapt to requirements of such new-generation software systems as the mobile system, Internet-of-things system and cyber-physical system on evolution of the place change driven system.

SUMMARY

In order to overcome the defects in the prior art, an objective of the present invention is to provide a place change driven software update method and apparatus that may describe place change information and system change information at the same time, and a readable storage medium.

The objective of the present invention may be implemented via the following solutions:

A place change driven software update method includes the following steps:

modeling a software architecture SA and a corresponding evolution rule set L⇒R through Bigraph;

acquiring a software architecture SA^(t) after movement and before evolution of the software architecture SA;

computing a place ΔP that changes between the SA and the SA^(t); and acquiring a set {ΔP₁, ΔP₂, . . . , ΔP_(n)} for all change places in the corresponding evolution rule set L⇒R;

determining whether the place ΔP belongs to the place set {ΔP₁, ΔP₂, . . . , ΔP_(n)}, and ending the method if no, or otherwise, acquiring a corresponding matching place ΔP_(j) of the place ΔP, thereby acquiring a corresponding evolution rule L_(j)→R_(j);

respectively computing a place graph L_(j) ^(P) and a link graph L_(j) ^(L) according to the L_(j), respectively computing a place graph SA^(P) and a link graph SA^(L) according to the software architecture SA, acquiring a matching subgraph G^(P) of the place graph L_(j) ^(P) in the place graph SA^(P), and acquiring a matching subgraph G^(L) of the link graph L_(j) ^(L) in the link graph SA^(L);

respectively computing a place graph R_(j) ^(P) and a link graph R_(j) ^(L) according to the R_(j), respectively cutting the matching subgraph G^(P) on the place graph SA^(P) with an isomorphically cut boundary cluster and replacing with the place graph R_(j) ^(P) to obtain a new SA place graph SA^(P,e), and cutting the matching subgraph G^(L) on the link graph SA^(L) and replacing with the link graph R_(j) ^(L) to obtain a new SA link graph SA^(L,e); and

merging the new SA place graph SA^(P,e) and the new SA link graph SA^(L,e) to obtain an evolved software architecture SA^(e), thereby implementing update of the software architecture SA.

Further, acquiring the new place graph SA^(P,e) is specifically as follows:

cutting the matching subgraph G^(P) from the place graph SA^(P), labeling a rest portion as SA^(P)/G^(P), determining whether the place graph R_(j) ^(P) of the R_(j) and the G^(P) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(P) to the SA^(P)/G^(P) if yes to acquire the new SA place graph SA^(P,e), or otherwise, not performing replacement operation.

Further, acquiring the new place graph SA^(P,e) is specifically as follows:

cutting the matching subgraph G^(L) from the link graph SA^(L), labeling a rest portion as SA^(L)/G^(L), determining whether the link graph R_(j) ^(L) of the R_(j) and the G^(L) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(L) to the SA^(L)/G^(L) if yes to acquire the new SA link graph SA^(L,e), or otherwise, not performing replacement operation.

Further, whether the evolution is triggered is determined with an ILER algorithm, thereby computing the place ΔP that changes between the SA and the SA^(t).

The present invention further provides a place change driven software update system, which includes:

an evolution rule matching module, configured to: model a software architecture SA and a corresponding evolution rule set L⇒R through Bigraph;

acquire a software architecture SA^(t) after movement and before evolution of the software architecture SA;

compute a place ΔP that changes between the SA and the SA^(t); and acquire a place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} for all change places in the corresponding evolution rule set L⇒R; and

determine whether the place ΔP belongs to the place set {ΔP₁, ΔP₂, . . . , ΔP_(n)}, and end the method if no, or otherwise, acquire a corresponding matching place ΔP_(j) of the place ΔP, thereby acquiring a corresponding evolution rule L_(j)→R_(j);

a place graph and link graph replacement module, configured to: respectively compute a place graph L_(j) ^(P) and a link graph L_(j) ^(L) according to the L_(j), respectively compute a place graph SA^(P) and a link graph SA^(L) according to the software architecture SA, acquire a matching subgraph G^(P) of the place graph L_(j) ^(P) in the place graph SA^(P), and acquire a matching subgraph G^(L) of the link graph L_(j) ^(L) in the link graph SA^(L); and

respectively compute a place graph R_(j) ^(P) and a link graph R_(j) ^(L) according to the R_(j), respectively cut the matching subgraph G^(P) on the place graph SA^(P) with an isomorphically cut boundary cluster and replace with the place graph R_(j) ^(P) to obtain a new SA place graph SA^(P,e), and cut the matching subgraph G^(L) on the link graph SA^(L) and replace with the link graph R_(j) ^(L) to obtain a new SA link graph SA^(L,e); and

a software update module, configured to: merge the new SA place graph SA^(P,e) and the new SA link graph SA^(L,e) to obtain an evolved software architecture SA^(e), thereby implementing update of the software architecture SA.

Further, acquiring the new place graph SA^(P,e) is specifically as follows:

cutting the matching subgraph G^(P) from the place graph SA^(P), labeling a rest portion as SA^(P)/G^(P), determining whether the place graph R_(j) ^(P) of the R_(j) and the G^(P) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(P) to the SA^(P)/G^(P) if yes to acquire the new SA place graph SA^(P,e), or otherwise, not performing replacement operation.

Further, acquiring the new place graph SA^(P,e) is specifically as follows:

cutting the matching subgraph G^(L) from the link graph SA^(L), labeling a rest portion as SA^(L)/G^(L), determining whether the link graph R_(j) ^(L) of the G^(L) and the G^(L) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(P) to the SA^(L)/G^(L) if yes to acquire the new SA link graph SA^(L,e), or otherwise, not performing replacement operation.

Further, whether the evolution is triggered is determined with an ILER algorithm, thereby computing the place ΔP that changes between the SA and the SA^(t).

The present invention further provides a computer readable storage medium, which stores a computer program thereon, wherein the computer program implements the following steps when executed by a processor:

modeling a software architecture SA and a corresponding evolution rule set L⇒R through Bigraph;

acquiring a software architecture SA^(t) after movement and before evolution of the software architecture SA;

computing a place ΔP that changes between the SA and the SA^(t); and acquiring a place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} for all change places in the corresponding evolution rule set L⇒R;

determining whether the place ΔP belongs to the place set {ΔP₁, ΔP₂, . . . , ΔP_(n)}, and ending the method if no, or otherwise, acquiring a corresponding matching place ΔP_(j) of the place ΔP, thereby acquiring a corresponding evolution rule L_(j)R_(j);

respectively computing a place graph L_(j) ^(P) and a link graph L_(j) ^(L) according to the L_(j), respectively computing a place graph SA^(P) and a link graph SA^(L) according to the software architecture SA, acquiring a matching subgraph G^(P) of the place graph L_(j) ^(P) in the place graph SA^(P), and acquiring a matching subgraph G^(L) of the link graph L_(j) ^(L) in the link graph SA^(L);

respectively computing a place graph R_(j) ^(P) and a link graph R_(j) ^(L) according to the R_(j), respectively cutting the matching subgraph G^(P) on the place graph SA^(P) with an isomorphically cut boundary cluster and replacing with the place graph R_(j) ^(P) to obtain a new SA place graph SA^(P,e), and cutting the matching subgraph G^(L) on the link graph SA^(L) and replace with the link graph R_(j) ^(L) to obtain a new SA link graph SA^(L,e), and

merging the new SA place graph SA^(P,e) and the new SA link graph SA^(L,e) to obtain an evolved software architecture SA^(e), thereby implementing update of the software architecture SA.

Further, acquiring the new place graph SA^(P,e) is specifically as follows:

cutting the matching subgraph G^(P) from the place graph SA^(P), labeling a rest portion as SA^(P)/G^(P), determining whether the place graph R_(j) ^(P) of the R_(j) and the G^(P) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(P) to the SA^(P)/G^(P) if yes to acquire the new SA place graph SA^(P,e), or otherwise, not performing replacement operation; and

acquiring the new place graph SA^(P,e) is specifically as follows:

cutting the matching subgraph G^(L) from the link graph SA^(L), labeling a rest portion as SA^(L)/G^(L), determining whether the link graph R_(j) ^(L) of the R_(j) and the G^(L) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(L) to the SA^(L)/G^(L) if yes to acquire the new SA link graph SA^(L,e), or otherwise, not performing replacement operation.

Compared with the prior art, the present invention has the following advantages:

(1) With the full utilization of the Bigraph that has the characteristics of both the place graph and the link graph, the method uniformly describes the place information, system link information, and evolution rule information for guiding dynamic evolution with the Bigraph under the same modeling language framework, such that all system evolved information may be described with the uniform model; and compared with conventional methods that a plurality of models are associated for conversion, the complexity, risk, unreliability of conversion between different models are avoided.

Furthermore, the present invention also makes up the shortages and difficult description situations of conventional requirement and environment driven dynamic evolution methods in description of the place information, and creates the dynamic evolution method that more focuses on place driving in such new-generation software systems as the mobile system, Internet-of-things system and cyber-physical system.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic diagram of a complete process of a place change driven software update method according to the present invention.

DESCRIPTION OF THE EMBODIMENTS

The present invention will be further described below in detail in conjunction with the accompanying drawings and specific embodiments. The embodiments are implemented on the basis of the technical solutions of the present invention, and offer the detailed implementation manners and specific operation process. However, the scope of protection of the present invention is not limited to the following embodiments.

Embodiment 1

The embodiment provides a place change driven software update method, which includes the following steps:

A software architecture SA and a corresponding evolution rule set L⇒R are modeled through Bigraph.

A software architecture SA^(t) after movement and before evolution of the software architecture SA is acquired.

A place ΔP that changes between the SA and the SA^(t) is computed; and a place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} for all change places in the corresponding evolution rule set L⇒R is acquired.

Whether the place ΔP belongs to the place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} is determined, and the method is ended if no, or otherwise, a corresponding matching place ΔP_(j) of the place ΔP is acquired, thereby acquiring a corresponding evolution rule L_(j)→R_(j).

A place graph L_(j) ^(P) and a link graph L_(j) ^(L) are respectively computed according to the L_(j), a place graph SA^(P) and a link graph SA^(L) are respectively computed according to the software architecture SA, a matching subgraph G^(P) of the place graph L_(j) ^(P) is acquired in the place graph SA^(P), and a matching subgraph G^(L) of the link graph L_(j) ^(L) is acquired in the link graph SA^(L).

A place graph R_(j) ^(P) and a link graph R_(j) ^(L) are respectively computed according to the R_(j), the matching subgraph G^(P) is respectively cut on the place graph SA^(P) with an isomorphically cut boundary cluster and replaced with the place graph R_(j) ^(P) to obtain a new SA place graph SA^(P,e), and the matching subgraph G^(L) is cut on the link graph SA^(L) and replaced with the link graph R_(j) ^(L) to obtain a new SA link graph SA^(L,e).

The new SA place graph SA^(P,e) and the new SA link graph SA^(L,e) are merged to obtain an evolved software architecture SA^(e), thereby implementing update of the software architecture SA.

Acquiring the new place graph SA^(P,e) is specifically as follows:

The matching subgraph G^(P) is cut from the place graph SA^(P), a rest portion is recorded as SA^(P)/G^(P), whether the place graph R_(j) ^(P) of the R_(j) and the G^(P) have an isomorphically cut boundary cluster is determined, and the R_(j) ^(P) is replaced to the SA^(P)/G^(P) if yes to acquire the new SA place graph SA^(P,e), or otherwise, replacement operation is not performed.

Acquiring the new link graph SA^(P,e) is specifically as follows:

The matching subgraph G^(L) is cut from the link graph SA^(L), a rest portion is recorded as SA^(L)/G^(L), whether the link graph R_(j) ^(L) of the R_(j) and the G^(L) have an isomorphically cut boundary cluster is determined, and the R_(j) ^(L) is replaced to the SA^(L)/G^(L) if yes to acquire the new SA link graph SA^(L,e), or otherwise, replacement operation is not performed.

Whether the evolution is triggered is determined with an ILER algorithm, thereby computing the place ΔP that changes between the SA and the SA^(t).

The descriptions will be made below to the specific implementation process in the embodiment.

1. Introductions on Basic Concepts

The software architecture having place information consists of a group of components, a link relationship between the components, and places where the components are located. The software architecture is modeled with Bigraph in the present invention, and represented as SA=(C, K, A, P, E_(P), E_(L), Cons). The place graph of the SA is SA^(P)=(C, K, P, E_(P), Cons), and the link graph of the SA is SA^(L)=(C, K, A, E_(L), Cons). C represents a set of the components; K represents a control set of the components, that is, a type set of the components; A represents a port set, and A=(A_(i), A_(o)), A_(i) and A_(o) respectively representing an input port set and an output port set; P=(P_(e), P_(r), C_(m)), P_(e) representing a set of place nodes, P_(r) representing a place relationship between place nodes P_(e), and these place relationships having four types of being independent, parallel, nested and intersected and being respectively represented by *, |, ⊃ and ∩, C_(m) being a mapping relationship from the component set C to the place set P_(e), and representing a place where each component is located; E_(P) represents an edge set between the place nodes, between the place node and the component node, and between the component nodes; E_(L) represents an edge set between ports of link components; and Cons represents a constrained relationship set of the structure. The software evolution rule L_(i)→R_(i) is also respectively described with the subgraphs of the Bigraph, and labeled as L_(i)=(C^(L), K^(L), A^(L), P^(L), E_(P) ^(L), E^(L) _(L), Cons^(L)), and R_(i)=(C^(R), K^(R), A^(R), P^(R), E_(P) ^(R), E_(L) ^(R), Cons^(R)). The evolution rule is a conversion process from one subgraph of the Bigraph to another subgraph of the Bigraph. All evolution rules are represented as L⇒R={L₁→R₁, L₂→R₂, . . . , L_(n)→R_(n)}.

2. Descriptions on Overall Technical Solutions

As shown in FIG. 1, first of all, the software architecture and the evolution rule are respectively modeled through Bigraph to obtain a software architecture SA before movement, a software architecture SA^(t) after movement and before evolution of the SA, and a group of preset evolution rule sets L=R={L₁→L₂→R₂, . . . , L_(n)→R_(n)}; whether the evolution is triggered is determined with an ILER algorithm (that is, an identification algorithm on the left of the evolution rule), the difference between the SA and the SA^(t) is computed as ΔP, {ΔP₁, ΔP₂, . . . , ΔP_(n)} of all evolution rules is then computed, ΔP_(j) corresponding to the ΔP is found in the set, the available evolution rule L_(j)→R_(j) is founded reversely through the ΔP_(j), and subgraphs G^(P) and G^(L) of the left L_(j) of the evolution rule are respectively matched on the place graph and link graph of the SA; then the matching subgraph G^(P) is cut on the place graph SA^(P) with an isomorphically cut boundary cluster and replaced with R_(j) ^(P) to obtain a new place graph SA^(P,e), and the matching subgraph G^(L) is cut on the link graph SA^(L) and then replaced with R_(j) ^(L) to obtain a new link graph SA^(L,e), and at last, the SA^(P,e) and the SA^(L,e) are synthesized to obtain the software architecture SA^(L,e) after evolution due to movement, thereby completing SA→SA^(e); and thereafter, the software system continuously keeps normal operation under the SA^(e).

3. Detailed Steps

The specific steps of the algorithm are as follows:

Step 1: a software architecture SA^(t)=(C^(t), K^(t), A^(t), P^(t), E_(P) ^(t), E_(L) ^(t), Cons^(t)) before some modules move but are not evolved is acquired from SA.

Step 2: place graphs SA^(P) and SA^(P,t) are respectively computed through the SA and the SA^(t), and a place ΔP is computed from the SA^(P) and the SA^(P,t) through a graph difference method.

Step 3: for any evolution rule L_(i)→R_(i) among all evolution rules L⇒R={L₁→R₁, L₂→R₂, . . . , L_(n)→R_(n)}, a place graph is also respectively used to compute a change place ΔP_(i), thereby acquiring a change place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} for all change places in the L⇒R.

Step 4: whether the ΔP belongs to the change place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} is determined; if the ΔP does not belong to the change place set, it is indicated that no evolution rule is set on the place ΔP, the evolution cannot be performed and the evolution is ended; or otherwise, the ΔP belongs to the change place set, a corresponding matching place ΔP_(j) is acquired, and a corresponding evolution rule L_(j)→R_(j) is reversely acquired in the L⇒R from the ΔP_(j).

Step 5: for the L_(j), a place graph L_(j) ^(P) and a link graph L_(j) ^(L) are respectively computed, a matching subgraph G^(P) of the L_(j) ^(P) is acquired in the SA^(P) in a graph matching method, and a matching subgraph G^(L) of the L_(j) ^(L) is acquired in the SA^(L) in a hypergraph matching method.

Step 6: the G^(P) is cut from the SA^(P), a rest portion is labeled as SA^(P)/G^(P), whether the place graph R_(j) ^(P) of the R_(j) and the G^(P) have an isomorphically cut boundary cluster is determined, and the R_(j) ^(P) is replaced to the SA^(P)/G^(P) if yes to acquire a new SA place graph SA^(P,e), or otherwise, replacement operation is not performed.

Step 7: the G^(L) is cut from the SA^(L), a rest portion is labeled as SA^(P)/G^(P), whether the link graph R_(j) ^(L) of the R_(j) and the G^(L) have an isomorphically cut boundary cluster is determined, and the R_(j) ^(L) is replaced to the SA^(L)/G^(L) if yes to acquire a new SA link graph SA^(L,e), or otherwise, replacement operation is not performed.

Step 8: at last, the new place graph SA^(P,e) and the new link graph SA^(L,e) are merged to obtain an evolved software architecture SA^(e).

The embodiment further provides a place change driven software update system, which includes:

an evolution rule matching module, configured to: model a software architecture SA and a corresponding evolution rule set L⇒R through Bigraph;

acquire a software architecture SA^(t) after movement and before evolution of the software architecture SA;

compute a place ΔP that changes between the SA and the SA^(t); and acquire a place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} for all change places in the corresponding evolution rule set L⇒R; and

determine whether the place ΔP belongs to the place set {ΔP₁, ΔP₂, . . . , ΔP_(n)}, and end the method if no, or otherwise, acquire a corresponding matching place ΔP_(j) of the place ΔP, thereby acquiring a corresponding evolution rule L_(j)→R_(j);

a place graph and link graph replacement module, configured to: respectively compute a place graph L_(j) ^(P) and a link graph L_(j) ^(L) according to the L_(j), respectively compute a place graph SA^(P) and a link graph SA^(L) according to the software architecture SA, acquire a matching subgraph G^(P) of the place graph L_(j) ^(P) in the place graph SA^(P), and acquire a matching subgraph G^(L) of the link graph L_(j) ^(L) in the link graph SA^(L); and

respectively compute a place graph R_(j) ^(P) and a link graph R_(j) ^(L) according to the R_(j), respectively cut the matching subgraph G^(P) on the place graph SA^(P) with an isomorphically cut boundary cluster and replace with the place graph R_(j) ^(P) to obtain a new SA place graph SA^(P,e), and cut the matching subgraph G^(L) on the link graph SA^(L) and replace with the link graph R_(j) ^(L) to obtain a new SA link graph SA^(L,e), and

a software update module, configured to: merge the new SA place graph SA^(P,e) and the new SA link graph SA^(L,e) to obtain an evolved software architecture SA^(e), thereby implementing update of the software architecture SA.

Acquiring the new place graph SA^(P,e) is specifically as follows:

The matching subgraph G^(P) is cut from the place graph SA^(P), a rest portion is recorded as SA^(P)/G^(P), whether the place graph R_(j) ^(P) of the R_(j) and the G^(P) have an isomorphically cut boundary cluster is determined, and the R_(j) ^(P) is replaced to the SA^(P)/G^(P) if yes to acquire the new SA place graph SA^(P,e), or otherwise, replacement operation is not performed.

Acquiring the new place graph SA^(P,e) is specifically as follows:

The matching subgraph G^(L) is cut in the link graph SA^(L), a rest portion is recorded as SA^(L)/G^(L), whether the link graph R_(j) ^(L) of the R_(j) and the G^(L) have an isomorphically cut boundary cluster is determined, and the R_(j) ^(L) is replaced to the SA^(L)/G^(L) if yes to acquire the new SA link graph SA^(L,e), or otherwise, replacement operation is not performed.

Whether the evolution is triggered is determined with an ILER algorithm, thereby computing the place ΔP that changes between the SA and the SA^(t).

The embodiment further provides a computer readable storage medium, which stores a computer program thereon, wherein the computer program implements the following steps when executed by a processor:

A software architecture SA and a corresponding evolution rule set L⇒R are modeled through Bigraph.

A software architecture SA^(t) is acquired after movement and before evolution of the software architecture SA.

A place ΔP that changes between the SA and the SA^(t) is computed; and a place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} for all change places in the evolution rule set L⇒R is acquired.

Whether the place ΔP belongs to the place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} is determined, and the method is ended if no, or otherwise, a corresponding matching place ΔP_(j) of the place ΔP is acquired, thereby acquiring a corresponding evolution rule L_(j)→R_(j).

A place graph L_(j) ^(P) and a link graph L_(j) ^(L) are respectively computed according to the L_(j), a place graph SA^(P) and a link graph SA^(L) are respectively computed according to the software architecture SA, a matching subgraph G^(P) of the place graph L_(j) ^(P) is acquired in the place graph SA^(P), and a matching subgraph G^(L) of the link graph L_(j) ^(L) in the link graph SA^(L) is acquired.

A place graph R_(j) ^(P) and a link graph R_(j) ^(L) are respectively computed according to the R_(j), the matching subgraph G^(P) on the place graph SA^(P) is respectively cut with an isomorphically cut boundary cluster and replaced with the place graph R_(j) ^(P) to obtain a new SA place graph SA^(P,e), and the matching subgraph G^(L) on the link graph SA^(L) is cut and replaced with the link graph R_(j) ^(L) to obtain a new SA link graph SA^(L,e).

The new SA place graph SA^(P,e) and the new SA link graph SA^(L,e) are merged to obtain an evolved software architecture SA^(e), thereby implementing update of the software architecture SA.

Acquiring the new place graph SA^(P,e) is specifically as follows:

The matching subgraph G^(P) is cut from the place graph SA^(P), a rest portion is recorded as SA^(P)/G^(P), whether the place graph R_(j) ^(P) of the R_(j) and the G^(P) have an isomorphically cut boundary cluster is determined, and the R_(j) ^(P) is replaced to the SA^(P)/G^(P) if yes to acquire the new SA place graph SA^(P,e), or otherwise, replacement operation is not performed.

Acquiring the new link graph SA^(P,e) is specifically as follows:

The matching subgraph G^(L) is cut in the link graph SA^(L), a rest portion is recorded as SA^(L)/G^(L), whether the link graph R_(j) ^(L) of the R_(j) and the G^(L) have an isomorphically cut boundary cluster is determined, and the R_(j) ^(L) is replaced to the SA^(L)/G^(L) if yes to acquire the new SA link graph SA^(L,e), or otherwise, replacement operation is not performed.

The embodiment further provides a mobile system, which includes a basic structure and an information processing module; and the information processing module performs software update with the above-mentioned place change driven software update method.

The embodiment further provides an Internet-of-Things system, which includes a basic structure and an information processing module; and the information processing module performs software update with the above-mentioned place change driven software update method.

The embodiment further provides a cyber-physical system, which includes a basic structure and an information processing module; and the information processing module performs software update with the above-mentioned place change driven software update method.

The above describes the preferred specific embodiments of the present invention in detail. It is to be understood that many modifications and alterations may be made by those of ordinary skill in the art without any creative labor according to the concept of the present invention. Therefore, any technical solution that may be obtained by those skilled in the art through logic analysis, inference or limited experiments on the basis of the prior art according to the concept of the present invention should fall within the scope of protection determined by the claims. 

What is claimed is:
 1. A place change driven software update method, comprising the following steps: modeling a software architecture SA and a corresponding evolution rule set L⇒R through Bigraph; acquiring a software architecture SA^(t) after movement and before evolution of the software architecture SA; computing a place ΔP that changes between the SA and the SA^(t); and acquiring a place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} for all change places in the evolution rule set L⇒R; determining whether the place ΔP belongs to the place set {ΔP₁, ΔP₂, . . . , ΔP_(n)}, and ending the method if no, or otherwise, acquiring a corresponding matching place ΔP_(j) of the place ΔP, thereby acquiring a corresponding evolution rule L_(j)→R_(j); respectively computing a place graph L_(j) ^(P) and a link graph L_(j) ^(L) according to the L_(j), respectively computing a place graph SA^(P) and a link graph SA^(L) according to the software architecture SA, acquiring a matching subgraph G^(P) of the place graph L_(j) ^(P) in the place graph SA^(P), and acquiring a matching subgraph G^(L) of the link graph L_(j) ^(L) in the link graph SA^(L); respectively computing a place graph R_(j) ^(P) and a link graph R_(j) ^(L) according to the R_(j), respectively cutting the matching subgraph G^(P) on the place graph SA^(P) with an isomorphically cut boundary cluster and replacing with the place graph R_(j) ^(P) to obtain a new SA place graph SA^(P,e), and cutting the matching subgraph G^(P) on the link graph SA^(L) and replacing with the link graph R_(j) ^(L) to obtain a new SA link graph SA^(L,e); and merging the new SA place graph SA^(P,e) and the new SA link graph SA^(L,e) to obtain an evolved software architecture SA^(e), thereby implementing update of the software architecture SA.
 2. The place change driven software update method according to claim 1, wherein acquiring the new place graph SA^(P,e) is specifically as follows: cutting the matching subgraph G^(P) from the place graph SA^(P), labeling a rest portion as SA^(P)/G^(P), determining whether the place graph R_(j) ^(P) of the R_(j) and the G^(P) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(P) to the SA^(P)/G^(P) if yes to acquire the new SA place graph SA^(P,e), or otherwise, not performing replacement operation.
 3. The place change driven software update method according to claim 2, wherein acquiring the new place graph SA^(P,e) is specifically as follows: cutting the matching subgraph G^(L) from the link graph SA^(L), labeling a rest portion as SA^(L)/G^(L), determining whether the link graph R_(j) ^(L) of the R_(j) and the G^(L) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(L) to the SA^(L)/G^(L) if yes to acquire the new SA link graph SA^(L,e), or otherwise, not performing replacement operation.
 4. The place change driven software update method according to claim 1, wherein whether the evolution is triggered is determined with an ILER algorithm, thereby computing the place ΔP that changes between the SA and the SA^(t).
 5. A place change driven software update system, comprising: an evolution rule matching module, configured to: model a software architecture SA and a corresponding evolution rule set L⇒R through Bigraph; acquire a software architecture SA^(t) after movement and before evolution of the software architecture SA; compute a place ΔP that changes between the SA and the SA^(t); and acquire a place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} for all change places in the corresponding evolution rule set L⇒R; and determine whether the place ΔP belongs to the place set {ΔP₁, ΔP₂, . . . , ΔP_(n)}, and end the method if no, or otherwise, acquire a corresponding matching place ΔP_(j) of the place ΔP, thereby acquiring a corresponding evolution rule L_(j)→R_(j); a place graph and link graph replacement module, configured to: respectively compute a place graph L_(j) ^(P) and a link graph L_(j) ^(L) according to the L_(j), respectively compute a place graph SA^(P) and a link graph SA^(L) according to the software architecture SA, acquire a matching subgraph G^(P) of the place graph L_(j) ^(P) in the place graph SA^(P), and acquire a matching subgraph G^(L) of the link graph L_(j) ^(L) in the link graph SA^(L); and respectively compute a place graph R_(j) ^(P) and a link graph R_(j) ^(L) according to the R_(j), respectively cut the matching subgraph G^(P) on the place graph SA^(P) with an isomorphically cut boundary cluster and replace with the place graph R_(j) ^(P) to obtain a new SA place graph SA^(P,e), and cut the matching subgraph G^(L) on the link graph SA^(L) and replace with the link graph R_(j) ^(L) to obtain a new SA link graph SA^(L,e), and a software update module, configured to: merge the new SA place graph SA^(P,e) and the new SA link graph SA^(L,e) to obtain an evolved software architecture SA^(e), thereby implementing update of the software architecture SA.
 6. The place change driven software update system according to claim 5, wherein acquiring the new place graph SA^(P,e) is specifically as follows: cutting the matching subgraph G^(P) from the place graph SA^(P), labeling a rest portion as SA^(P)/G^(P), determining whether the place graph R_(j) ^(P) of the R_(j) and the G^(P) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(P) to the SA^(P)/G^(P) if yes to acquire the new SA place graph SA^(P,e), or otherwise, not performing replacement operation.
 7. The place change driven software update system according to claim 6, wherein acquiring the new link graph SA^(P,e) is specifically as follows: cutting the matching subgraph G^(L) from the link graph SA^(L), labeling a rest portion as SA^(L)/G^(L), determining whether the link graph R_(j) ^(L) of the R_(j) and the G^(L) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(L) to the SA^(L)/G^(L) if yes to acquire the new SA link graph SA^(L,e), or otherwise, not performing replacement operation.
 8. The place change driven software update system according to claim 5, wherein whether the evolution is triggered is determined with an ILER algorithm, thereby computing the place ΔP that changes between the SA and the SA^(t).
 9. A computer readable storage medium, storing a computer program thereon, wherein the computer program implements the following steps when executed by a processor: modeling a software architecture SA and a corresponding evolution rule set L⇒R through Bigraph; acquiring a software architecture SA^(t) after movement and before evolution of the software architecture SA; computing a place ΔP that changes between the SA and the SA^(t); and acquiring a place set {ΔP₁, ΔP₂, . . . , ΔP_(n)} for all change places in the corresponding evolution rule set L⇒R; determining whether the place ΔP belongs to the place set {ΔP₁, ΔP₂, . . . , ΔP_(n)}, and ending the method if no, or otherwise, acquiring a corresponding matching place ΔP_(j) of the place ΔP, thereby acquiring a corresponding evolution rule L_(j)→R_(j); respectively computing a place graph L_(j) ^(P) and a link graph L_(j) ^(L) according to the L_(j), respectively computing a place graph SA^(P) and a link graph SA^(L) according to the software architecture SA, acquiring a matching subgraph G^(P) of the place graph L_(j) ^(P) in the place graph SA^(P), and acquiring a matching subgraph G^(L) of the link graph L_(j) ^(L) in the link graph SA^(L); respectively computing a place graph R_(j) ^(P) and a link graph R_(j) ^(L) according to the R_(j), respectively cutting the matching subgraph G^(P) on the place graph SA^(P) with an isomorphically cut boundary cluster and replacing with the place graph R_(j) ^(P) to obtain a new SA place graph SA^(P,e), and cutting the matching subgraph G^(L) on the link graph SA^(L) and replacing with the link graph R_(j) ^(L) to obtain a new SA link graph SA^(L,e); and merging the new SA place graph SA^(P,e) and the new SA link graph SA^(L,e) to obtain an evolved software architecture SA^(e), thereby implementing update of the software architecture SA.
 10. The computer readable storage medium according to claim 9, wherein acquiring the new place graph SA^(P,e) is specifically as follows: cutting the matching subgraph G^(P) from the place graph SA^(P), labeling a rest portion as SA^(P)/G^(P), determining whether the place graph R_(j) ^(P) of the R_(j) and the G^(P) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(P) to the SA^(P)/G^(P) if yes to acquire the new SA place graph SA^(P,e), or otherwise, not performing replacement operation; acquiring the new link graph SA^(P,e) is specifically as follows: cutting the matching subgraph G^(L) from the link graph SA^(L), labeling a rest portion as SA^(L)/G^(L), determining whether the link graph R_(j) ^(L) of the R_(j) and the G^(L) have an isomorphically cut boundary cluster, and replacing the R_(j) ^(L) to the SA^(L)/G^(L) if yes to acquire the new SA link graph SA^(L,e), or otherwise, not performing replacement operation. 